Converting between Combinatory Reduction Systems and Big Step Semantics
Identifieur interne : 003975 ( Main/Exploration ); précédent : 003974; suivant : 003976Converting between Combinatory Reduction Systems and Big Step Semantics
Auteurs : Hanne Gottliebsen [Danemark] ; Kristoffer H. RoseSource :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We make a connection between higher-order rewriting in the form of combinatory reduction systems (CRS) and logic-based operational semantics in the form of big step semantic (BSS) specifications. We show how sets of CRS rewrite rules can be encoded as BSS, and how BSS (including natural semantics) can be encoded as CRS. The connections permit the use of proper variables and substitution in both formalisms.
Url:
DOI: 10.1007/978-3-642-04164-8_15
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002F03
- to stream Istex, to step Curation: 002E65
- to stream Istex, to step Checkpoint: 000A82
- to stream Main, to step Merge: 003A53
- to stream Main, to step Curation: 003975
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Converting between Combinatory Reduction Systems and Big Step Semantics</title><author><name sortKey="Gottliebsen, Hanne" sort="Gottliebsen, Hanne" uniqKey="Gottliebsen H" first="Hanne" last="Gottliebsen">Hanne Gottliebsen</name></author><author><name sortKey="Rose, Kristoffer H" sort="Rose, Kristoffer H" uniqKey="Rose K" first="Kristoffer H." last="Rose">Kristoffer H. Rose</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:C624DF0129A42907B6FF652EE77C72EBCDC73432</idno><date when="2009" year="2009">2009</date><idno type="doi">10.1007/978-3-642-04164-8_15</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-091WG98C-8/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002F03</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002F03</idno><idno type="wicri:Area/Istex/Curation">002E65</idno><idno type="wicri:Area/Istex/Checkpoint">000A82</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000A82</idno><idno type="wicri:doubleKey">0302-9743:2009:Gottliebsen H:converting:between:combinatory</idno><idno type="wicri:Area/Main/Merge">003A53</idno><idno type="wicri:Area/Main/Curation">003975</idno><idno type="wicri:Area/Main/Exploration">003975</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Converting between Combinatory Reduction Systems and Big Step Semantics </title><author><name sortKey="Gottliebsen, Hanne" sort="Gottliebsen, Hanne" uniqKey="Gottliebsen H" first="Hanne" last="Gottliebsen">Hanne Gottliebsen</name><affiliation wicri:level="1"><country xml:lang="fr">Danemark</country><wicri:regionArea>Brorsonsgade 8, 1.th, 1624, Copenhagen V</wicri:regionArea><wicri:noRegion>Copenhagen V</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Danemark</country></affiliation></author><author><name sortKey="Rose, Kristoffer H" sort="Rose, Kristoffer H" uniqKey="Rose K" first="Kristoffer H." last="Rose">Kristoffer H. Rose</name><affiliation></affiliation><affiliation><wicri:noCountry code="no comma">E-mail: krisrose@us.ibm.com</wicri:noCountry></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We make a connection between higher-order rewriting in the form of combinatory reduction systems (CRS) and logic-based operational semantics in the form of big step semantic (BSS) specifications. We show how sets of CRS rewrite rules can be encoded as BSS, and how BSS (including natural semantics) can be encoded as CRS. The connections permit the use of proper variables and substitution in both formalisms.</div></front></TEI><affiliations><list><country><li>Danemark</li></country></list><tree><noCountry><name sortKey="Rose, Kristoffer H" sort="Rose, Kristoffer H" uniqKey="Rose K" first="Kristoffer H." last="Rose">Kristoffer H. Rose</name></noCountry><country name="Danemark"><noRegion><name sortKey="Gottliebsen, Hanne" sort="Gottliebsen, Hanne" uniqKey="Gottliebsen H" first="Hanne" last="Gottliebsen">Hanne Gottliebsen</name></noRegion><name sortKey="Gottliebsen, Hanne" sort="Gottliebsen, Hanne" uniqKey="Gottliebsen H" first="Hanne" last="Gottliebsen">Hanne Gottliebsen</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003975 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 003975 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:C624DF0129A42907B6FF652EE77C72EBCDC73432
|texte= Converting between Combinatory Reduction Systems and Big Step Semantics
}}
| This area was generated with Dilib version V0.6.33. |  |